Pronominal doubling under predicate topicalization

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Lexical-Functional Analysis of Predicate Topicalization in German

In this paper we examine the topicalization paradigm for ten different verbal constructions in German. We argue that a uniform explanation for the observed behaviors follows from the interpretation of the relevant expressions as (parts of) lexical representations. To this end we motivate a revision of Functional Uncertainty as proposed in Kaplan and Zaenen (1989) to account for filler/gap relat...

متن کامل

The Prosody of Topicalization

Because of the elusive nature of pitch accents and prosodic phrasing, the role of prosody has been neglected too often in the description of the syntax-phonology interface. This paper shows that the syntactic structure of German sentences is shaped by the formation of prosodic phrases, and that many puzzles are solved if prosodic phrasing and accents are systematically considered in formal gram...

متن کامل

Asymmetry in Emphatic Topicalization

Southern German of the Austro-Bavarian type is known for its disrespect of the Doubly-Filled-COMP Filter (DFCF). Wh-questions and relative clauses are generally formed by moving the wh-phrase or the relative operator to the specifier of an overt complementizer. The examples in (1) and (2) from Bayer (1984) illustrate the construction: (1) a. I woaß ned wer daß des dõa hot INDIRECT QUESTION I kn...

متن کامل

Global Predicate Detection under Fine-Grained Modalities

Predicate detection is an important problem in distributed systems. Based on the temporal interactions of intervals, there exists a rich class of modalities under which global predicates can be specified. For a conjunctive predicate φ, we show how to detect the traditional Possibly(φ) and Definitely(φ) modalities along with the added information of the exact interaction type between each pair o...

متن کامل

Predicate Abstraction with Under-Approximation Refinement

We propose an abstraction-based model checking method which relies on refinement of an under-approximation of the feasible behaviors of the system under analysis. The method preserves errors to safety properties, since all analyzed behaviors are feasible by definition. The method does not require an abstract transition relation to be generated, but instead executes the concrete transitions whil...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Lingua

سال: 2009

ISSN: 0024-3841

DOI: 10.1016/j.lingua.2007.11.007